Nonseparating Independent Sets of Cartesian Product Graphs
نویسندگان
چکیده
منابع مشابه
Alliance free sets in Cartesian product graphs
Let G = (V,E) be a graph. For a non-empty subset of vertices S ⊆ V , and vertex v ∈ V , let δS(v) = |{u ∈ S : uv ∈ E}| denote the cardinality of the set of neighbors of v in S, and let S = V − S. Consider the following condition: δS(v) ≥ δS(v) + k, (1) which states that a vertex v has at least k more neighbors in S than it has in S. A set S ⊆ V that satisfies Condition (1) for every vertex v ∈ ...
متن کاملThe reliability Wiener number of cartesian product graphs
Reliability Wiener number is a modification of the original Wiener number in which probabilities are assigned to edges yielding a natural model in which there are some (or all) bonds in the molecule that are not static. Various probabilities naturally allow modelling different types of chemical bonds because chemical bonds are of different types and it is well-known that under certain condition...
متن کاملSecret Sharing Based On Cartesian product Of Graphs
The purpose of this paper is to study the information ratio of perfect secret sharing of product of some special families of graphs. We seek to prove that the information ratio of prism graphs $Y_{n}$ are equal to $frac{7}{4}$ for any $ngeq 5$, and we will gave a partial answer to a question of Csirmaz cite{CL}. We will also study the information ratio of two other families $C_{m}times C_{n}$ a...
متن کاملOptimal Independent Spanning Trees on Cartesian Product of Hybrid Graphs
A set of k spanning trees rooted at the same vertex r in a graph G are called independent spanning trees (ISTs) if for any vertex x 6= r, the k paths from v to r, one path in each tree, are internally disjoint. The design of ISTs on graphs has applications to fault-tolerant broadcasting and secure message distribution in networks. It was conjectured that for any k-connected graph there exist k ...
متن کاملOn unique minimum dominating sets in some Cartesian product graphs
Unique minimum vertex dominating sets in the Cartesian product of a graph with a complete graph are considered. We first give properties of such sets when they exist. We then show that when the first factor of the product is a tree, consideration of the tree alone is sufficient to determine if the product has a unique minimum dominating set.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Taiwanese Journal of Mathematics
سال: 2020
ISSN: 1027-5487
DOI: 10.11650/tjm/190303